Descent for semiorthogonal decompositions
نویسندگان
چکیده
We prove descent theorems for semiorthogonal decompositions using techniques from derived algebraic geometry. Our methods allow us to capture more general filtrations of categories and even marked filtrations, where one descends not only admissible subcategories but also preferred objects.
منابع مشابه
Base Change for Semiorthogonal Decompositions
Let X be an algebraic variety over a base scheme S and φ : T → S a faithful base change. Given an admissible subcategory A in D(X), the bounded derived category of coherent sheaves on X, we construct an admissible subcategory AT in D b(X×ST ), called the base change of A, in such a way that the following base change theorem holds: if a semiorthogonal decomposition of D(X) is given then the base...
متن کاملHochschild Homology and Semiorthogonal Decompositions
We investigate Hochschild cohomology and homology of admissible subcategories of derived categories of coherent sheaves on smooth projective varieties. We show that the Hochschild cohomology of an admissible subcategory is isomorphic to the derived endomorphisms of the kernel giving the corresponding projection functor, and the Hochschild homology is isomorphic to derived morphisms from this ke...
متن کاملOn descent for coalgebras and type transformations
We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...
متن کاملAdjusting the Rayleigh Quotient in Semiorthogonal Lanczos Methods Adjusting the Rayleigh Quotient in Semiorthogonal Lanczos Methods
In a semiorthogonal Lanczos algorithm, the orthogonality of the Lanczos vectors is allowed to deteriorate to roughly the square root of the rounding unit, after which the current vectors are reorthogonalized. A theorem of Simon 4] shows that the Rayleigh quotient | i.e., the tridiagonal matrix produced by the Lanczos recursion | contains fully accurate approximations to the Ritz values in spite...
متن کاملHandwritten Character Recognition using Modified Gradient Descent Technique of Neural Networks and Representation of Conjugate Descent for Training Patterns
The purpose of this study is to analyze the performance of Back propagation algorithm with changing training patterns and the second momentum term in feed forward neural networks. This analysis is conducted on 250 different words of three small letters from the English alphabet. These words are presented to two vertical segmentation programs which are designed in MATLAB and based on portions (1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2021
ISSN: ['1857-8365', '1857-8438']
DOI: https://doi.org/10.1016/j.aim.2021.107600